首页> 外文OA文献 >Large-scale computation of elementary flux modes with bit pattern trees
【2h】

Large-scale computation of elementary flux modes with bit pattern trees

机译:具有位模式树的基本通量模式的大规模计算

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Motivation: Elementary flux modes (EFMs)—non-decomposable minimal pathways—are commonly accepted tools for metabolic network analysis under steady state conditions. Valid states of the network are linear superpositions of elementary modes shaping a polyhedral cone (the flux cone), which is a well-studied convex set in computational geometry. Computing EFMs is thus basically equivalent to extreme ray enumeration of polyhedral cones. This is a combinatorial problem with poorly scaling algorithms, preventing the large-scale analysis of metabolic networks so far. Results: Here, we introduce new algorithmic concepts that enable large-scale computation of EFMs. Distinguishing extreme rays from normal (composite) vectors is one critical aspect of the algorithm. We present a new recursive enumeration strategy with bit pattern trees for adjacent rays—the ancestors of extreme rays—that is roughly one order of magnitude faster than previous methods. Additionally, we introduce a rank updating method that is particularly well suited for parallel computation and a residue arithmetic method for matrix rank computations, which circumvents potential numerical instability problems. Multi-core architectures of modern CPUs can be exploited for further performance improvements. The methods are applied to a central metabolism network of Escherichia coli, resulting in ≈26 Mio. EFMs. Within the top 2% modes considering biomass production, most of the gain in flux variability is achieved. In addition, we compute ≈5 Mio. EFMs for the production of non-essential amino acids for a genome-scale metabolic network of Helicobacter pylori. Only large-scale EFM analysis reveals the >85% of modes that generate several amino acids simultaneously. Availability: An implementation in Java, with integration into MATLAB and support of various input formats, including SBML, is available at http://www.csb.ethz.ch in the tools section; sources are available from the authors upon request. Contact: joerg.stelling@inf.ethz.ch Supplementary information: Supplementary data are available at Bioinformatics online
机译:动机:基本通量模式(EFM)(不可分解的最小途径)是稳态条件下进行代谢网络分析的常用工具。网络的有效状态是形成多面圆锥体(通量圆锥体)的基本模态的线性叠加,该多面体圆锥体是计算几何学中经过充分研究的凸集。因此,计算EFM基本上等效于多面体圆锥体的极端射线枚举。这是缩放比例不佳的算法的组合问题,目前为止还无法对代谢网络进行大规模分析。结果:在这里,我们介绍了可实现EFM大规模计算的新算法概念。区分法线(复合)矢量的极端光线是该算法的一个关键方面。我们提出了一种新的递归枚举策略,该策略具有用于相邻射线(极限射线的祖先)的位模式树的功能,其速度比以前的方法快大约一个数量级。此外,我们引入了一种特别适合并行计算的秩更新方法和一种用于矩阵秩计算的残差算术方法,从而避免了潜在的数值不稳定问题。可以利用现代CPU的多核体系结构进一步提高性能。该方法应用于大肠杆菌的中央代谢网络,产生约26 Mio的能量。 EFM。在考虑生物量生产的前2%模式中,通量可变性的大部分增益均已实现。另外,我们计算出≈5Mio。用于产生幽门螺杆菌基因组规模代谢网络的非必需氨基酸的EFM。只有大规模EFM分析才能揭示> 85%的模式同时生成几种氨基酸。可用性:http://www.csb.ethz.ch的“工具”部分提供了Java的实现,该实现已集成到MATLAB中并支持各种输入格式,包括SBML。来源可应要求从作者处获得。联系人:joerg.stelling@inf.ethz.ch补充信息:补充数据可从在线生物信息学获得

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号